Constructions of Near-Optimal Extractors Using Pseudo-Random Generators
نویسنده
چکیده
We introduce a new approach to construct extractors — combinatorial objects akin to expander graphs that have several applications. Our approach is based on error correcting codes and on the Nisan-Wigderson pseudorandom generator. An application of our approach yields a construction that is simple to describe and analyze, does not utilize any of the standard techniques used in related results, and improves or subsumes almost all the previous constructions.
منابع مشابه
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-co...
متن کاملNear-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dtime(2), that requires circuits of size s(n), (for some function s). These results are based on the NW-generator [?]. For the strong lower bound s(n) = 2 , [?], and later [?] get the optimal derandomization, P = BPP . Ho...
متن کاملRandomness extractors -- applications and constructions
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the applications, as...
متن کاملTwo-sources Randomness Extractors for Elliptic Curves
This paper studies the task of two-sources randomness extractors for elliptic curves defined over a finite field K, where K can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which take in input two random points from two different subgroups. In other words, for a given elliptic curve E defined over a finite field Fq and two random points...
متن کاملLimits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators
The standard approach for constructing a large-stretch pseudorandom generator given a one-way permutation or given a smaller-stretch pseudo-random generator involves repeatedly composing the given primitive with itself. In this paper, we consider whether this approach is necessary, that is, whether there are constructions that do not involve composition. More formally, we consider black-box con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 5 شماره
صفحات -
تاریخ انتشار 1998